Memetic Algorithm for Computing Shortest Paths in Multimodal Transportation Networks
نویسندگان
چکیده
منابع مشابه
Partial order approach to compute shortest paths in multimodal networks
Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena, manufacturing process and telecommunication networks. Existing techniques for determining optimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing ...
متن کاملA Hybrid Algorithm for Computing Constrained Shortest Paths
Considerable efforts have been dedicated to develop both heuristic and approximation algorithms for the NP-complete delay-constrained least-cost (DCLC) routing problem, but to the best of our knowledge, no prior work has been done to mingle the two tracks of research. In this paper we introduce a novel idea to show how a heuristic method can be used to boost the average performance of an approx...
متن کاملShortest Paths in Networks
Finding the shortest path between two points in a network is a fundamental problem in computer science with many applications. By exploiting properties of the underlying networks we improve and extend one of the state-of-the-art algorithms for finding shortest paths in road networks, TRANSIT. We develop a new algorithm for finding shortest paths in public multi-modal transport networks, where w...
متن کاملShortest paths on a polyhedron, Part I: Computing shortest paths
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2015
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2015.09.028